Recognizing Shrinkable Complexes Is NP-Complete
نویسندگان
چکیده
We say that a simplicial complex is shrinkable if there exists a sequence of admissible edge contractions that reduces the complex to a single vertex. We prove that it is NP-complete to decide whether a (two-dimensional) simplicial complex is shrinkable. Along the way, we describe examples of contractible complexes that are not shrinkable.
منابع مشابه
Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
A graph is unfrozen with respect to k independent set if it has an independent set of size k after the addition of any edge. The problem of recognizing such graphs is known to be NP-complete. A graph is maximal if the addition of one edge means it is no longer unfrozen. We designate the problem of recognizing maximal unfrozen graphs as MAX(U(k-SET)) and show that this problem is CO-NP-complete....
متن کاملRecognizing Pseudo-intents is coNP-complete
The problem of recognizing whether a subset of attributes is a pseudo-intent is shown to be coNP-hard, which together with the previous results means that this problem is coNP-complete. Recognizing an essential intent is shown to be NP-complete and recognizing the lectically largest pseudo-intent is shown to be coNP-hard.
متن کاملSymmetry, Optical Properties and Thermodynamics of Neptunium(V) Complexes
Recent results on the optical absorption and symmetry of the Np(V) complexes with dicarboxylate and diamide ligands are reviewed. The importance of recognizing the “silent” feature of centrosymmetric Np(V) species in analyzing the absorption spectra and calculating the thermodynamic constants of Np(V) complexes is emphasized.
متن کاملOn the computational complexity of evolution
It is well-known that the problem of recognizing an ESS in a symmetric bimatrix game is coNPcomplete. In this paper, we show that recognizing an ESS even in doubly symmetric bimatrix games is also coNP-complete. Our result further implies that recognizing asymptotically stable equilibria of the replicator dynamic in this class of games is also a coNP-complete problem. It is also known that a st...
متن کاملOn the complexity of recognizing a orderable graphs
Recently Middendorf and Pfeiffer proved that recognizing perfectly orderable graphs is NP-complete. Hoang and Reed had previously studied six natural subclasses of perfectly orderable graphs that are defined by the orientations of the P,‘s. Four of the six classes can be recognized in polynomial time. We show in this paper that it is NP-complete to recognize the fifth class.
متن کامل